Polynomial-time reducibilities and “almost all” oracle sets
نویسندگان
چکیده
منابع مشابه
Strong and Robustly Strong Polynomial Time Reducibilities to Sparse Sets
GavaldB, R. and J.L. BalcBzar, Strong and robustly strong polynomial time reducibilities to sparse sets, Theoretical Computer Science 88 (1991) I-14. Reducibility defined by oracle strong nondeterministic machines is studied. Two definitions of relativized strength are presented and separated. The corresponding reduction classes of the sparse sets give two nonuniform analogs of the class NPncoN...
متن کاملProofs, Codes, and Polynomial-Time Reducibilities
We show how to construct proof systems for NP languages where a deterministic polynomial-time veriier can check membership, given any N (2=3)+ bits of an N-bit witness of membership. We also provide a slightly super-polynomial time proof system where the veriier can check membership, given only N (1=2)+ bits of an N-bit witness. In addition, we construct proof systems where a deterministic poly...
متن کاملA Comparison of Polynomial Time Reducibilities
&tract. Various forms of polynomial time reducibilig:y zwe compared. Among the forms examined we many-one, bounded truth table, truth 1:able and Turing reducibi!&y. The effect of introducing nondeterminism into red " ,ztiGn procedures is also examined. Computation bounded reducibilities play a role in t theory of' ssralputationa~ complexity which is analogous to, and perhaps as important as, th...
متن کاملWhen almost all sets are difference dominated
We investigate the relationship between the sizes of the sum and difference sets attached to a subset of {0, 1, ..., N}, chosen randomly according to a binomial model with parameter p(N), with N = o(p(N)). We show that the random subset is almost surely difference dominated, as N → ∞, for any choice of p(N) tending to zero, thus confirming a conjecture of Martin and O’Bryant. Furthermore, we ex...
متن کاملPolynomial Running Times for Polynomial-Time Oracle Machines
This paper introduces a more restrictive notion of feasibility of functionals on Baire space than the established one from second-order complexity theory. Thereby making it possible to consider functions on the natural numbers as running times of oracle Turing machines and avoiding secondorder polynomials, which are notoriously difficult to handle. Furthermore, all machines that witness this st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1991
ISSN: 0304-3975
DOI: 10.1016/0304-3975(91)90314-r